On the facets of the simple plant location packing polytope

Valid inequalities and facets of the capacitated plant location problem

Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide ran...

New facets for the set packing polytope

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Quadratic Semi-Assignment Polytope

We study a polytope which arises from a mixed integer programming formulation of the quadratic semi-assignment problem. We introduce an isomorphic projection in order to transform the polytope to another essentially equivalent and tractable polytope. As a result, some basic polyhedral properties, such as the dimension, the affine hull, and the trivial facets, are obtained in quite a simple way....

Some Results on facets for linear inequality in 0-1 variables

The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first pa...

Geometric shellings of 3-polytopes

A total order of the facets of a polytope is a geometric shelling if there exists a combinatorially equivalent polytope in which the corresponding order of facets becomes a line shelling. The subject of this paper is (geometric) shellings of 3-polytopes. Recently, a graph theoretical characterization of geometric shellings of 3-polytopes were given by Holt & Klee and Mihalisin & Klee. We rst gi...